SHARE A SECRET IMAGE WITH INVERTIBLE AND LOSSY CHARATERISTICS

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lossy Secret Color Image Sharing Scheme with Small Shadows and Error-resilient Capability

A novel secret sharing scheme for color images with small shadows and error-resilient capability was proposed that combines compressive sensing and Shamir’s (k, n)-threshold scheme. Since the human eye is more sensitive to the luminance of an image than its chromaticity, first, this scheme converts RGB images into YUV format and compresses the components of luminance and chrominance using a dif...

متن کامل

Ideal Secret Sharing Schemes with Share Selectability

In this paper, we investigate a new concept, called share selectable secret sharing, where no unauthorized set can obtain information of the secret (in the information-theoretic sense) even if shares are selectable as arbitrary values which are independent of the secret. We propose two totally selectable (i.e., all users’ shares are selectable) secret sharing schemes with unanimous structure. W...

متن کامل

Secret Share Dissemination across a Network

Secret sharing is an important component of several cryptographic protocols. These include protocols for secure multiparty function computation, key management, and secure archival storage. Most protocols assume that the dealer has direct communication links with every participant, in which case, the dealer can directly communicate the respective shares to all participants. In this paper, we co...

متن کامل

How to Share a Secret, Infinitely

Secret sharing schemes allow a dealer to distribute a secret piece of information among several parties so that any qualified subset of parties can reconstruct the secret, while every unqualified subset of parties learns nothing about the secret. The collection of qualified subsets is called an access structure. The best known access structure is the k-threshold one, where any subset of size k ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Electronic Commerce Studies

سال: 2016

ISSN: 2073-9729

DOI: 10.7903/ijecs.1467